Efficient Query Answering in DL-Lite through FOL Reformulation (Extended Abstract)
نویسندگان
چکیده
We propose a general query optimization framework for formalisms enjoying FOL reducibility of query answering, for which it reduces to the evaluation of a FOL query against facts. This framework allows searching within a set of alternative equivalent FOL queries, i.e., FOL reformulations, one with minimal evaluation cost when evaluated through a relational database management system. We provide two algorithms, an exhaustive and a greedy, for exploring the optimization space. This framework is applied to the lightweight description logic DL-LiteR underpinning the W3C’s OWL2 QL profile, for which an experimental evaluation validates the interest and applicability of our technique.
منابع مشابه
Combining DL-Lite with Spatial Calculi for Feasible Geo-thematic Query Answering
First order logic (FOL) rewritability is a desirable feature for query answering over geo-thematic ontologies because in most geoprocessing scenarios one has to cope with large data volume. Hence, there is a need for combined geo-thematic logics that provide a sufficiently expressive query language allowing for FOL rewritability. The DL-Lite family of description logics is tailored towards FOL ...
متن کاملScalable Geo-thematic Query Answering
First order logic (FOL) rewritability is a desirable feature for query answering over geo-thematic ontologies because in most geoprocessing scenarios one has to cope with large data volumes. Hence, there is a need for combined geo-thematic logics that provide a sufficiently expressive query language allowing for FOL rewritability. The DL-Lite family of description logics is tailored towards FOL...
متن کاملEQL-Lite: Effective First-Order Query Processing in Description Logics
Querying Description Logic knowledge bases has received great attention in the last years. In such a problem, the need of coping with incomplete information is the distinguishing feature with respect to querying databases. Due to this feature, we have to deal with two conflicting needs: on the one hand, we would like to query the knowledge base with sophisticated mechanisms provided by full fir...
متن کاملQuery Rewriting for Inconsistent DL-Lite Ontologies
In this paper we study the problem of obtaining meaningful answers to queries posed over inconsistent DL-Lite ontologies. We consider different variants of inconsistency-tolerant semantics and show that for some of such variants answering unions of conjunctive queries (UCQs) is first-order (FOL) rewritable, i.e., it can be reduced to standard evaluation of a FOL/SQL query over a database. Since...
متن کاملQuery Rewriting in DL-Lite_^(HN)_horn
In this paper we present practical algorithms for query answering and knowledge base satisfiability checking in DL-Lite ) horn , a logic from the extended DL-Lite family that contains horn concept inclusions and number restriction. This logic is the most expressive DL that is shown to be FOL-rewritable. The algorithms we present are based on the rewriting technique so that reasoning over the TB...
متن کامل